A comparative application of convex hullalgorithms in two

The problem of computing the convex hull of a nite set of points arises often in practice and is a cornerstone of any geometric software library. The 2-and 3-dimensional cases are of special interest due to their direct correspondence with physical entities. Several algorithms have been designed and developped for general dimension but also for this case. The aim of this work is to apply existing implementations of general as well as speciic algorithms, namely quickhull, including those from general libraries such as Cgal and Leda, on real and arti-cially constructed problems and compare their performance in terms of speed, accuracy, and robustness.